Context-sensitive dependency pairs
نویسندگان
چکیده
منابع مشابه
Context-Sensitive Dependency Pairs
Termination is one of the most interesting problems when dealing with context-sensitive rewrite systems. Although there is a good number of techniques for proving termination of context-sensitive rewriting (CSR), the dependency pair approach, one of the most powerful techniques for proving termination of rewriting, has not been investigated in connection with proofs of termination of CSR. In th...
متن کاملImproving Context-Sensitive Dependency Pairs
Context-sensitive dependency pairs (CS-DPs) are currently the most powerful method for automated termination analysis of contextsensitive rewriting. However, compared to DPs for ordinary rewriting, CS-DPs suffer from two main drawbacks: (a) CS-DPs can be collapsing. This complicates the handling of CS-DPs and makes them less powerful in practice. (b) There does not exist a “DP framework” for CS...
متن کاملProving Termination in the Context-Sensitive Dependency Pairs Framework
Termination of context-sensitive rewriting (CSR) is an interesting problem with several applications in the fields of term rewriting and in the analysis of programming languages like CafeOBJ, Haskell, Maude, OBJ, etc. The dependency pairs approach, one of the most powerful techniques for proving termination of rewriting, has been adapted to be used for proving termination of CSR. The correspond...
متن کاملTermination of Innermost Context-Sensitive Rewriting Using Dependency Pairs
Innermost context-sensitive rewriting has been proved useful for modeling computations of programs of algebraic languages like Maude, OBJ, etc. Furthermore, innermost termination of rewriting is often easier to prove than termination. Thus, under appropriate conditions, a useful strategy for proving termination of rewriting is trying to prove termination of innermost rewriting. This phenomenon ...
متن کاملMildly Context-Sensitive Dependency Languages
Dependency-based representations of natural language syntax require a fine balance between structural flexibility and computational complexity. In previous work, several constraints have been proposed to identify classes of dependency structures that are wellbalanced in this sense; the best-known but also most restrictive of these is projectivity. Most constraints are formulated on fully specif...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 2010
ISSN: 0890-5401
DOI: 10.1016/j.ic.2010.03.003